Performance improvement of adaptive filters for echo cancellation applications

This work focuses on performance improvement of adaptive algorithms for both line and acoustic echo cancellation applications. Echo in telephone networks, Line Echo, is observed naturally due to impedance mismatches at the long-distance/local-loop interface. Acoustic echo is due to the acoustic coupling between the microphone and the speaker of a speakerphone. The Affine Projection (APA) and the Fast Affine Projection (FAP) algorithms are two examples of reliable and efficient adaptive filters used for echo cancellation...This thesis presents, Variable Regularized Fast Affine Projections (VR-FAP) algorithm, with a varying, optimal regularization value which provides the desirable property of both fast and low misadjustment of the filter --Abstract, page iii

Variable Regularized Fast Affine Projections

This paper introduces a variable regularization method for the fast affine projection algorithm (VR-FAP). It is inspired by a recently introduced technique for variable regularization of the classical, affine projection algorithm (VR-APA). In both algorithms, the regularization parameter varies as a function of the excitation, measurement noise, and residual error energies. Because of the dependence on the last parameter, VR-APA and VR-FAP demonstrate the desirable property of fast convergence (via a small regularization value) when the convergence is poor and deep convergence/immunity to measurement noise (via a large regularization value) when the convergence is good. While the regularization parameter of APA is explicitly available for on-line modification, FAP\u27s regularization is only set at initialization. To overcome this problem we use noise-injection with the noise-power proportional to the variable regularization parameter. As with their fixed regularization versions, VR-FAP is considerably less complex than VR-APA and simulations verify that they have the very similar convergence propertie

A Cost-Effective Solution for Non-Convex Economic Load Dispatch Problems in Power Systems Using Slime Mould Algorithm

Slime Mould Algorithm (SMA) is a newly designed meat-heuristic search that mimics the nature of slime mould during the oscillation phase. This is demonstrated in a unique mathematical formulation that utilizes adjustable weights to influence the sequence of both negative and positive propagation waves to develop a method to link food supply with intensive exploration capacity and exploitation affinity. The study shows the usage of the SM algorithm to solve a non-convex and cost-effective Load Dispatch Problem (ELD) in an electric power system. The effectiveness of SMA is investigated for single area economic load dispatch on large-, medium-, and small-scale power systems, with 3-, 5-, 6-, 10-, 13-, 15-, 20-, 38-, and 40-unit test systems, and the results are substantiated by finding the difference between other well-known meta-heuristic algorithms. The SMA is more efficient than other standard, heuristic, and meta-heuristic search strategies in granting extremely ambitious outputs according to the comparison records

A common variant mapping to <i>CACNA1A </i>is associated with susceptibility to exfoliation syndrome

Author manuscript available from PMC http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4605818/Exfoliation syndrome (XFS) is the most common recognizable cause of open-angle glaucoma worldwide. To better understand the etiology of XFS, we conducted a genome-wide association study (GWAS) of 1,484 cases and 1,188 controls from Japan and followed up the most significant findings in a further 6,901 cases and 20,727 controls from 17 countries across 6 continents. We discovered a genome-wide significant association between a new locus (CACNA1A rs4926244) and increased susceptibility to XFS (odds ratio (OR) = 1.16, P = 3.36 × 10−11). Although we also confirmed overwhelming association at the LOXL1 locus, the key SNP marker (LOXL1 rs4886776) demonstrated allelic reversal depending on the ancestry group (Japanese: ORA allele = 9.87, P = 2.13 × 10−217; non-Japanese: ORA allele = 0.49, P = 2.35 × 10−31). Our findings represent the first genetic locus outside of LOXL1 surpassing genome-wide significance for XFS and provide insight into the biology and pathogenesis of the disease

Genetic Association Study Of Exfoliation Syndrome Identifies A Protective Rare Variant At Loxl1 And Five New Susceptibility Loci

Exfoliation syndrome (XFS) is the most common known risk factor for secondary glaucoma and a major cause of blindness worldwide. Variants in two genes, LOXL1 and CACNA1A, have previously been associated with XFS. To further elucidate the genetic basis of XFS, we collected a global sample of XFS cases to refine the association at LOXL1, which previously showed inconsistent results across populations, and to identify new variants associated with XFS. We identified a rare protective allele at LOXL1 (p.Phe407, odds ratio (OR) = 25, P = 2.9 x 10(-14)) through deep resequencing of XFS cases and controls from nine countries. A genome-wide association study (GWAS) of XFS cases and controls from 24 countries followed by replication in 18 countries identified seven genome-wide significant loci (P < 5 x 10(-8)). We identified association signals at 13q12 (POMP), 11q23.3 (TMEM136), 6p21 (AGPAT1), 3p24 (RBMS3) and 5q23 (near SEMA6A). These findings provide biological insights into the pathology of XFS and highlight a potential role for naturally occurring rare LOXL1 variants in disease biology.Wo